$C\sp \ast$-extreme points of some compact $C\sp \ast$-convex sets

Extreme Points of Polar Convex Sets

Backdoor Sets for CSP

A backdoor set of a CSP instance is a set of variables whose instantiation moves the instance into a fixed class of tractable instances (an island of tractability). An interesting algorithmic task is to find a small backdoor set efficiently: once it is found we can solve the instance by solving a number of tractable instances. Parameterized complexity provides an adequate framework for studying...

Analysis Type Lex / Parse Translation Optimizer Back End AST AST

This paper proposes an alternate structure for C++ compilers. Type analysis is removed from the compiler and replaced with a type system library which is treated as source code by the compiler. Type computations are embedded in the intermediate language of the compiler, and partial evaluation is used to drive type analysis and template in-stantiation. By making simple changes to the behavior of...

Approximating Extreme Points of Infinite Dimensional Convex Sets

The property that an optimal solution to the problem of minimizing a continuous concave function over a compact convex set in IRn is attained at an extreme point is generalized by the Bauer Minimum Principle to the infinite dimensional context. The problem of approximating and characterizing infinite dimensional extreme points thus becomes an important problem. Consider now an infinite dimensio...

Extreme Points in Convex Sets of Symmetric Matrices

This paper deals with the following problem: What are the extreme points of a convex set K of n X n matrices, which is the intersection of the set S„ of symmetric matrices of nonnegative type, with another convex subset of symmetric matrices HI In the case where the facial structure of H is known, we expose a general method to determine the extreme points of K (Theorem 1). Then, we apply this m...